New trends in exact algorithmsfor the 0 - 1 knapsack
نویسندگان
چکیده
While the 1980s were focused on the solution of large sized \easy" knapsack problems , this decade has brought several new algorithms, which are able to solve \hard" large sized instances. We will give an overview of the recent techniques for solving hard knapsack problems, with special emphasis on the addition of cardinality constraints , dynamic programming, and rudimentary divisibility. Computational results, comparing all recent algorithms, are presented.
منابع مشابه
New trends in exact algorithms for the 0-1 knapsack problem
While the 1980s were focused on the solution of large sized ``easy'' knapsack problems (KPs), this decade has brought several new algorithms, which are able to solve ``hard'' large sized instances. We will give an overview of the recent techniques for solving hard KPs, with special emphasis on the addition of cardinality constraints, dynamic programming, and rudimentary divisibility. Computatio...
متن کاملExact and approximate algorithms for discounted {0-1} knapsack problem
The D iscounted {0-1} K napsack P roblem (D{0-1}KP) is an extension of the classical 0-1 knapsack problem (0-1 KP) that consists of selecting a set of item groups where each group includes three items and at most one of the three items can be selected. The D{0-1}KP is more challenging than the 0-1 KP because four choices of items in an item group diversify the selection of the items. In this pa...
متن کاملDynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, where, in addition, valid inequalities are generated and surrogate relaxed, and a new initial core problem is adopted. The algorithm is able to solve all classical test instances, with up to 10,000 variables, in less than...
متن کاملGenetic Algorithms for 0/1 Multidimensional Knapsack Problems
An important class of combinatorial optimization problems are the Multidimensional 0/1 Knapsacks, and various heuristic and exact methods have been devised to solve them. Among these, Genetic Algorithms have emerged as a powerful new search paradigms. We show how a proper selection of parameters and search mechanisms lead to an implementation of Genetic Algorithms that yields high quality solut...
متن کاملSeparation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To use such inequalities effectively, one needs separation algorithms for them, i.e., routines for detecting when they are violated. We show that the separation problems for the so-called extended cover and weight inequalities can be solved exactly in O(nb) time and O((n+ amax)b)...
متن کامل